Dynamic Programming 2 – Interactive Visualizers

Explore advanced DP applications: Edit Distance, Knapsack, and Coin Change — learn how recursion and memoization optimize real-world problems.

Session 1 – Edit Distance

Visualize text transformation using classic DP for edit distance.

Open Visualizer ↗

Session 1 – Generalized Edit Distance

Understand extended edit distance logic for manuscript corrections.

Open Visualizer ↗

Session 2 – Knapsack (Jack’s Treasure Hunt)

Solve the treasure hunt using the branch and bound technique.

Open Visualizer ↗

Session 2 – Knapsack (Bounded Optimization)

Explore weight/value optimization using DP and bounding heuristics.

Open Visualizer ↗

Session 3 – Coin Change I

Find the minimum number of coins to make change for a given value.

Open Visualizer ↗

Session 3 – Coin Change II

Count the number of combinations to achieve target sum efficiently.

Open Visualizer ↗